package org.hhchat.others.erp;

import java.util.Scanner;

/**
 * Created this one by HMH on 2017/5/24.
 */
public class Main3 {

    static int mod = 1000;

    public static void main(String[] args){
        //输入
        Scanner in = new Scanner(System.in);
        while(in.hasNextInt()){
            int n = in.nextInt();
            int m = in.nextInt();
            int[] numbers = new int[n];
            int sum=0;
            for(int i=0;i<n;i++){
                numbers[i] = in.nextInt();
                sum += numbers[i]%=mod;
            }
            if(sum==0 || sum<m){
                System.out.println("No");
            }else{
                System.out.println(solve(n,m,numbers,sum)?"Yes":"No");
            }
        }
    }

    public static boolean solve(int n, int m, int[] numbers,int sum) {
        boolean dp[] = new boolean[sum + 1];
        for(int i=0;i<n;i++){
            for(int j=sum;j>numbers[i];j--) {
                dp[j] = (Math.abs((j - numbers[i]) % m) == Math.abs((m - numbers[i])%mod));
                if(dp[j]){
                    return dp[j];
                }
            }
        }
        return false;
    }

}
